A fast boundary element algorithm for time-dependant potential problems
نویسندگان
چکیده
منابع مشابه
Fast Multipole Boundary Element Method of Potential Problems
In order to overcome the difficulties of low computational efficiency and high memory requirement in the conventional boundary element method for solving large-scale potential problems, a fast multipole boundary element method for the problems of Laplace equation is presented. through the multipole expansion and local expansion for the basic solution of the kernel function of the Laplace equati...
متن کاملA fast multipole boundary element method for 2D viscoelastic problems
A fast multipole formulation for 2D linear viscoelastic problems is presented in this paper by incorporating the elastic–viscoelastic correspondence principle. Systems of multipole expansion equations are formed and solved analytically in Laplace transform domain. Three commonly used viscoelastic models are introduced to characterize the time-dependent behavior of the materials. Since the trans...
متن کاملBoundary element methods for potential problems with nonlinear boundary conditions
Galerkin boundary element methods for the solution of novel first kind Steklov–Poincaré and hypersingular operator boundary integral equations with nonlinear perturbations are investigated to solve potential type problems in twoand three-dimensional Lipschitz domains with nonlinear boundary conditions. For the numerical solution of the resulting Newton iterate linear boundary integral equations...
متن کاملThe fast multipole boundary element method for potential problems: A tutorial
The fast multipole method (FMM) has been regarded as one of the top 10 algorithms in scientific computing that were developed in the 20th century. Combined with the FMM, the boundary element method (BEM) can now solve large-scale problems with several million degrees of freedom on a desktop computer within hours. This opened up a wide range of applications for the BEM that has been hindered for...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 1998
ISSN: 0307-904X
DOI: 10.1016/s0307-904x(98)00016-x